Global Optimality Conditions for a Dynamic Blocking Problem
نویسندگان
چکیده
The paper is concerned with a class of optimal blocking problems in the plane. We consider a time dependent set R(t) ⊂ IR, described as the reachable set for a differential inclusion. To restrict its growth, a barrier can be constructed, in real time. This is a one-dimensional rectifiable set which blocks the trajectories of the differential inclusion. In this paper we introduce a definition of “regular strategy”, based on a careful classification of blocking arcs. Moreover, we derive local and global necessary conditions for an optimal strategy, which minimizes the value of the region ∪t≥0R(t) plus the cost of constructing the barrier. We show that a Lagrange multiplier, corresponding to the constraint on the construction speed, can be interpreted as the “instantaneous value of time”. This value, which we compute by two separate formulas, remains constant when free arcs are constructed and is monotone decreasing otherwise.
منابع مشابه
Sufficient global optimality conditions for general mixed integer nonlinear programming problems
In this paper, some KKT type sufficient global optimality conditions for general mixed integer nonlinear programming problems with equality and inequality constraints (MINPP) are established. We achieve this by employing a Lagrange function for MINPP. In addition, verifiable sufficient global optimality conditions for general mixed integer quadratic programming problems are der...
متن کاملA New Optimal Solution Concept for Fuzzy Optimal Control Problems
In this paper, we propose the new concept of optimal solution for fuzzy variational problems based on the possibility and necessity measures. Inspired by the well–known embedding theorem, we can transform the fuzzy variational problem into a bi–objective variational problem. Then the optimal solutions of fuzzy variational problem can be obtained by solving its corresponding biobjective variatio...
متن کاملSequential Optimality Conditions and Variational Inequalities
In recent years, sequential optimality conditions are frequently used for convergence of iterative methods to solve nonlinear constrained optimization problems. The sequential optimality conditions do not require any of the constraint qualications. In this paper, We present the necessary sequential complementary approximate Karush Kuhn Tucker (CAKKT) condition for a point to be a solution of a ...
متن کاملTail optimality and preferences consistency for intertemporal optimization problems
When an intertemporal optimization problem over a time interval [t0, T ] is linear and can be solved via dynamic programming, the Bellman’s principle holds, and the optimal control map has the desirable feature of being tail-optimal in the right queue; moreover, the optimizer keeps solving the same problem at any time time t with renovated conditions: we will say that he is preferences-consiste...
متن کاملA New Branch-and-Bound for the Problem of Mean Completion Time for the Single Machine with Release Time
Preemptively scheduling a set of independent jobs with release time on one processor is a historical problem. In this paper, the same problem has been considered in which objective is to minimize the mean flow time. To prepare a perfect branch-and-bound, some optimality conditions have been represented and they have been compared with the optimality conditions which have been proposed before. O...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010